Hybrid Control Laws From Convex Dynamic Programming
نویسندگان
چکیده
In a previous paper, we showed how classical ideas for dynamic programming in discrete networks can be adapted to hybrid systems. The approach is based on discretization of the continuous Bellman inequality which gives a lower bound on the optimal cost. The lower bound is maximized by linear programming to get an approximation of the optimal solution. In this paper, we apply ideas from infinitedimensional convex analysis to get an inequality which is dual to the well known Bellman inequality. The result is a linear programming problem that gives an estimate of the approximation error in the previous numerical approaches.
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملA combined multi-parametric and dynamic programming approach for model predictive control of hybrid linear systems
This work presents a methodology to derive explicit control laws for hybrid linear systems. The proposed method employs multi-parametric and dynamic programming techniques to dissemble the original MPC formulation into a set of smaller problems, which can be efficiently solved using suitable multi-parametric mixed integer programming algorithms. The solution comprises the envelope of explicit p...
متن کاملConvex dynamic programming for hybrid systems
A classical linear programming approach to optimization of flow or transportation in a discrete graph is extended to hybrid systems. The problem is finite dimensional if the state space is discrete and finite, but becomes infinite dimensional for a continuous or hybrid state space. It is shown how strict lower bounds on the optimal loss function can be computed by gridding the continuous state ...
متن کاملTrajectory Optimization for Hybrid Control in Cluttered Environments
In this project we present an end-to-end approach for controlling hybrid dynamical systems that are operating in a cluttered environment. Our problem setting poses a significant challenge for typical hybrid control systems because of the non-convex constraints introduced by obstacles. In fact, it is a generalization of a very recent approach for trajectory optimization for hybrid control, which...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کامل